Methods and systems for managing connected data transfer sessions

ABSTRACT

Systems, methods, and computer-readable storage media are provided for managing connected data transfer sessions in a computing network. A controller included in the computing network can monitor connected data transfer sessions to determine whether a predetermined threshold has been met or exceeded and, if so, terminate at least one connected data transfer session in the computing network. The threshold can include a threshold number of connected data communication sessions and/or a threshold amount of resources utilized by the connected data communication sessions. The controller can terminate connected data transfer sessions until the total number of connected data communication sessions and/or threshold amount of resources falls below the threshold.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of, and priority to, U.S.Non-Provisional patent application Ser. No. 14/794,523, filed Jul. 8,2015, which claims the benefit of U.S. Provisional Patent ApplicationNo. 62/167,796, filed May 28, 2015, which are incorporated herein byreference in their entireties.

TECHNICAL FIELD

The present disclosure relates generally to computer networks, and morespecifically to management of connected data transfer sessions.

BACKGROUND

Modern computing networks operate with an increasing number of computingnodes to support a wide variety of applications and services. Computingnodes in the networks may include a switch (e.g., a router) or an endpoint (e.g., a host device). Nodes in a computing network cancommunicate with each other to transfer data. Communications between thecomputing nodes can be facilitated using an available protocol. Forexample, communications can be performed using protocols that provideconnected data transfer sessions between computing nodes, such as theTransmission Control Protocol (TCP). A connected data transfer sessioncan be an established connection between computing nodes to transferdata. To establish a connected data transfer session, a negotiation canbe performed between the computing nodes to establish a socket to socketvirtual connection that remains open throughout the duration of theconnected data transfer session. An advantage of a connected datatransfer session is that the recipient computing node acknowledges eachreceived packet and packet retransmissions can be performed if packetsare missed or arrive out of order. In contrast, protocols that do notrequire the establishment of a connection, such as Internet Protocol(IP), do not provide acknowledgement for received packets. As a result,these protocols can result in an unreliable packet delivery system wherepackets can arrive out of order or not at all.

While connected data transfer sessions provide a reliable packetdelivery system, they can also present some challenges. For example,each connected data transfer session utilizes some amount of resources,such as bandwidth, until the connected data transfer session isterminated. As a result, a high number of connected data transfersessions, even if not being used to transfer data, can reduce availableresources and lead to network congestion, such as blocking newconnections, queueing delays or packet loss. Current systems rely onusers to manage terminating connected data transfer sessions when theyare no longer needed or are being unused. If not terminated, ‘inactive’connected data transfer sessions (e.g., connected data transfer sessionsthat are not being used to transfer data) can continue to utilizeresources.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited features andother advantages of the disclosure can be obtained, a more particulardescription of the principles briefly described above will be renderedby reference to specific embodiments thereof which are illustrated inthe appended drawings. Understanding that these drawings depict onlyexemplary embodiments of the disclosure and are not therefore to beconsidered to be limiting its scope, the principles herein are describedand explained with additional specificity and detail through the use ofthe accompanying drawings in which:

FIG. 1 illustrates an example network device according to some aspectsof the subject technology;

FIG. 2A and 2B illustrate an example system embodiments according tosome aspects of the subject technology;

FIG. 3 illustrates a schematic block diagram of an example architecturefor a network fabric;

FIG. 4 illustrates an example overlay network;

FIG. 5 illustrates an example system embodiment of a controllerconfigured to manage connected data transfer session in a computingnetwork;

FIG. 6 illustrates one example method of a controller managing connecteddata transfer sessions in a computing network; and

FIG. 7 illustrates another example method of a controller managingconnected data transfer sessions in a computing network.

DESCRIPTION OF EXAMPLE EMBODIMENTS

The detailed description set forth below is intended as a description ofvarious configurations of the subject technology and is not intended torepresent the only configurations in which the subject technology can bepracticed. The appended drawings are incorporated herein and constitutea part of the detailed description. The detailed description includesspecific details for the purpose of providing a more thoroughunderstanding of the subject technology. However, it will be clear andapparent that the subject technology is not limited to the specificdetails set forth herein and may be practiced without these details. Insome instances, structures and components are shown in block diagramform in order to avoid obscuring the concepts of the subject technology.

Overview

Disclosed are systems, methods, and computer-readable storage media formanaging connected data transfer sessions in a computing network.Various embodiments of the present technology can be used to monitor andterminate connected data transfer sessions as needed to manage networkresource usage. For example, a controller comprising of one or morecomputing nodes in a network can be configured to monitor the number ofconnected data transfer sessions between computing nodes of the networkand determine whether the number of connected data transfer sessionsmeets or exceeds a threshold number and, if so, terminate one or moreconnected data transfer session until the number of connected datatransfer sessions falls below the threshold number. Terminating aconnected transfer session can include terminating the socket to socketvirtual connection between the computing the nodes associated with theconnected data transfer session.

In some embodiments, the controller can be configured to monitorresource usage by the connected data transfer sessions (e.g., bandwidth)and determine whether a total resource usage meets or exceeds athreshold resource usage amount. If so, the controller can terminate oneor more of the connected data transfer sessions until the total resourceusage is below the threshold resource usage amount.

The controller can determine which connected data transfer sessions toterminate in numerous ways and based on multiple factors. For example,the controller can terminate the connected data transfer sessions basedon a timestamp value associated with each data transfer session. Atimestamp value can indicate the time at which the latest data packetwas transmitted using the data transfer session. The controller canterminate the connected data transfer session based on the times stampvalues such that the connected data transfer session with the earliesttimestamp value (e.g., the data transfer session that has remainedunused the longest) is terminated.

In some embodiments, the controller can rank the connected data transfersessions and select a connected data transfer session to terminate basedon the ranking. For example, the controller can rank the connected datatransfer sessions based one or more factors, such as timestamp values,priority values assigned to the connected data transfer sessions, thecomputing nodes utilizing the connected data transfer sessions, etc. Thecontroller can then select the data transfer session with the lowestranking to be terminated.

DETAILED DESCRIPTION

A computer network is a geographically distributed collection of nodesinterconnected by communication links and segments for transporting databetween endpoints, such as personal computers and workstations. Manytypes of networks are available, with the types ranging from local areanetworks (LANs) and wide area networks (WANs) to overlay andsoftware-defined networks, such as virtual extensible local areanetworks (VXLANs).

LANs typically connect nodes over dedicated private communications linkslocated in the same general physical location, such as a building orcampus. WANs, on the other hand, typically connect geographicallydispersed nodes over long-distance communications links, such as commoncarrier telephone lines, optical lightpaths, synchronous opticalnetworks (SONET), or synchronous digital hierarchy (SDH) links. LANs andWANs can include layer 2 (L2) and/or layer 3 (L3) networks and devices.

The Internet is an example of a WAN that connects disparate networksthroughout the world, providing global communication between nodes onvarious networks. The nodes typically communicate over the network byexchanging discrete frames or packets of data according to predefinedprotocols, such as the Transmission Control Protocol/Internet Protocol(TCP/IP). In this context, a protocol can refer to a set of rulesdefining how the nodes interact with each other. Computer networks maybe further interconnected by an intermediate network node, such as arouter, to extend the effective “size” of each network.

Overlay networks generally allow virtual networks to be created andlayered over a physical network infrastructure. Overlay networkprotocols, such as Virtual Extensible LAN (VXLAN), NetworkVirtualization using Generic Routing Encapsulation (NVGRE), NetworkVirtualization Overlays (NVO3), and Stateless Transport Tunneling (STT),provide a traffic encapsulation scheme which allows network traffic tobe carried across L2 and L3 networks over a logical tunnel. Such logicaltunnels can be originated and terminated through virtual tunnel endpoints (VTEPs).

Moreover, overlay networks can include virtual segments, such as VXLANsegments in a VXLAN overlay network, which can include virtual L2 and/orL3 overlay networks over which virtual machines (VMs) communicate. Thevirtual segments can be identified through a virtual network identifier(VNI), such as a VXLAN network identifier, which can specificallyidentify an associated virtual segment or domain.

Network virtualization allows hardware and software resources to becombined in a virtual network. For example, network virtualization canallow multiple numbers of VMs to be attached to the physical network viarespective virtual LANs (VLANs). The VMs can be grouped according totheir respective VLAN, and can communicate with other VMs as well asother devices on the internal or external network.

Network segments, such as physical or virtual segments; networks;devices; ports; physical or logical links; and/or traffic in general canbe grouped into a bridge or flood domain. A bridge domain or flooddomain can represent a broadcast domain, such as an L2 broadcast domain.A bridge domain or flood domain can include a single subnet, but canalso include multiple subnets. Moreover, a bridge domain can beassociated with a bridge domain interface on a network device, such as aswitch. A bridge domain interface can be a logical interface whichsupports traffic between an L2 bridged network and an L3 routed network.In addition, a bridge domain interface can support internet protocol(IP) termination, VPN termination, address resolution handling, MACaddressing, etc. Both bridge domains and bridge domain interfaces can beidentified by a same index or identifier.

Furthermore, endpoint groups (EPGs) can be used in a network for mappingapplications to the network. In particular, EPGs can use a grouping ofapplication endpoints in a network to apply connectivity and policy tothe group of applications. EPGs can act as a container for buckets orcollections of applications, or application components, and tiers forimplementing forwarding and policy logic. EPGs also allow separation ofnetwork policy, security, and forwarding from addressing by insteadusing logical application boundaries.

Cloud computing can also be provided in one or more networks to providecomputing services using shared resources. Cloud computing can generallyinclude Internet-based computing in which computing resources aredynamically provisioned and allocated to client or user computers orother devices on-demand, from a collection of resources available viathe network (e.g., “the cloud”). Cloud computing resources, for example,can include any type of resource, such as computing, storage, andnetwork devices, virtual machines (VMs), etc. For instance, resourcesmay include service devices (firewalls, deep packet inspectors, trafficmonitors, load balancers, etc.), compute/processing devices (servers,CPU's, memory, brute force processing capability), storage devices(e.g., network attached storages, storage area network devices), etc. Inaddition, such resources may be used to support virtual networks,virtual machines (VM), databases, applications (Apps), etc.

Cloud computing resources may include a “private cloud,” a “publiccloud,” and/or a “hybrid cloud.” A “hybrid cloud” can be a cloudinfrastructure composed of two or more clouds that inter-operate orfederate through technology. In essence, a hybrid cloud is aninteraction between private and public clouds where a private cloudjoins a public cloud and utilizes public cloud resources in a secure andscalable manner. Cloud computing resources can also be provisioned viavirtual networks in an overlay network, such as a VXLAN.

FIG. 1 illustrates an exemplary network device 110 suitable forimplementing the present technology. Network device 110 includes amaster central processing unit (CPU) 162, interfaces 168, and a bus 115(e.g., a PCI bus). When acting under the control of appropriate softwareor firmware, the CPU 162 is responsible for executing packet management,error detection, and/or routing functions, such policy enforcement, forexample. The CPU 162 preferably accomplishes all these functions underthe control of software including an operating system and anyappropriate applications software. CPU 162 may include one or moreprocessors 163 such as a processor from the Motorola family ofmicroprocessors or the MIPS family of microprocessors. In an alternativeembodiment, processor 163 is specially designed hardware for controllingthe operations of router 110. In a specific embodiment, a memory 161(such as non-volatile RAM and/or ROM) also forms part of CPU 162.However, there are many different ways in which memory could be coupledto the system.

The interfaces 168 are typically provided as interface cards (sometimesreferred to as “line cards”). Generally, they control the sending andreceiving of data packets over the network and sometimes support otherperipherals used with the network device 110. Among the interfaces thatmay be provided are Ethernet interfaces, frame relay interfaces, cableinterfaces, DSL interfaces, token ring interfaces, and the like. Inaddition, various very high-speed interfaces may be provided such asfast token ring interfaces, wireless interfaces, Ethernet interfaces,Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POSinterfaces, FDDI interfaces and the like. Generally, these interfacesmay include ports appropriate for communication with the appropriatemedia. In some cases, they may also include an independent processorand, in some instances, volatile RAM. The independent processors maycontrol such communications intensive tasks as packet switching, mediacontrol, and management. By providing separate processors for thecommunications intensive tasks, these interfaces allow the mastermicroprocessor 162 to efficiently perform routing computations, networkdiagnostics, security functions, etc.

Although the system shown in FIG. 1 is one specific network device ofthe present technology, it is by no means the only network devicearchitecture on which the present technology can be implemented. Forexample, an architecture having a single processor that handlescommunications as well as routing computations, etc. is often used.Further, other types of interfaces and media could also be used with therouter.

Regardless of the network device's configuration, it may employ one ormore memories or memory modules (including memory 161) configured tostore program instructions for the general-purpose network operationsand mechanisms for roaming, route optimization and routing functionsdescribed herein. The program instructions may control the operation ofan operating system and/or one or more applications, for example. Thememory or memories may also be configured to store tables such asmobility binding, registration, and association tables, etc.

FIG. 2A, and FIG. 2B illustrate exemplary possible system embodiments.The more appropriate embodiment will be apparent to those of ordinaryskill in the art when practicing the present technology. Persons ofordinary skill in the art will also readily appreciate that other systemembodiments are possible.

FIG. 2A illustrates a conventional system bus computing systemarchitecture 200 wherein the components of the system are in electricalcommunication with each other using a bus 205. Exemplary system 200includes a processing unit (CPU or processor) 210 and a system bus 205that couples various system components including the system memory 215,such as read only memory (ROM) 220 and random access memory (RAM) 225,to the processor 210. The system 200 can include a cache of high-speedmemory connected directly with, in close proximity to, or integrated aspart of the processor 210. The system 200 can copy data from the memory215 and/or the storage device 230 to the cache 212 for quick access bythe processor 210. In this way, the cache can provide a performanceboost that avoids processor 210 delays while waiting for data. These andother modules can control or be configured to control the processor 210to perform various actions. Other system memory 215 may be available foruse as well. The memory 215 can include multiple different types ofmemory with different performance characteristics. The processor 210 caninclude any general purpose processor and a hardware module or softwaremodule, such as module 1 232, module 2 234, and module 3 236 stored instorage device 230, configured to control the processor 210 as well as aspecial-purpose processor where software instructions are incorporatedinto the actual processor design. The processor 210 may essentially be acompletely self-contained computing system, containing multiple cores orprocessors, a bus, memory controller, cache, etc. A multi-core processormay be symmetric or asymmetric.

To enable user interaction with the computing device 200, an inputdevice 245 can represent any number of input mechanisms, such as amicrophone for speech, a touch-sensitive screen for gesture or graphicalinput, keyboard, mouse, motion input, speech and so forth. An outputdevice 235 can also be one or more of a number of output mechanismsknown to those of skill in the art. In some instances, multimodalsystems can enable a user to provide multiple types of input tocommunicate with the computing device 200. The communications interface240 can generally govern and manage the user input and system output.There is no restriction on operating on any particular hardwarearrangement and therefore the basic features here may easily besubstituted for improved hardware or firmware arrangements as they aredeveloped.

Storage device 230 is a non-volatile memory and can be a hard disk orother types of computer readable media which can store data that areaccessible by a computer, such as magnetic cassettes, flash memorycards, solid state memory devices, digital versatile disks, cartridges,random access memories (RAMs) 225, read only memory (ROM) 220, andhybrids thereof.

The storage device 230 can include software modules 232, 234, 236 forcontrolling the processor 210. Other hardware or software modules arecontemplated. The storage device 230 can be connected to the system bus205. In one aspect, a hardware module that performs a particularfunction can include the software component stored in acomputer-readable medium in connection with the necessary hardwarecomponents, such as the processor 210, bus 205, display 235, and soforth, to carry out the function.

FIG. 2B illustrates a computer system 250 having a chipset architecturethat can be used in executing the described method and generating anddisplaying a graphical user interface (GUI). Computer system 250 is anexample of computer hardware, software, and firmware that can be used toimplement the disclosed technology. System 250 can include a processor255, representative of any number of physically and/or logicallydistinct resources capable of executing software, firmware, and hardwareconfigured to perform identified computations. Processor 255 cancommunicate with a chipset 260 that can control input to and output fromprocessor 255. In this example, chipset 260 outputs information tooutput 265, such as a display, and can read and write information tostorage device 270, which can include magnetic media, and solid statemedia, for example. Chipset 260 can also read data from and write datato RAM 275. A bridge 280 for interfacing with a variety of userinterface components 285 can be provided for interfacing with chipset260. Such user interface components 285 can include a keyboard, amicrophone, touch detection and processing circuitry, a pointing device,such as a mouse, and so on. In general, inputs to system 250 can comefrom any of a variety of sources, machine generated and/or humangenerated.

Chipset 260 can also interface with one or more communication interfaces290 that can have different physical interfaces. Such communicationinterfaces can include interfaces for wired and wireless local areanetworks, for broadband wireless networks, as well as personal areanetworks. Some applications of the methods for generating, displaying,and using the GUI disclosed herein can include receiving ordereddatasets over the physical interface or be generated by the machineitself by processor 255 analyzing data stored in storage 270 or 275.Further, the machine can receive inputs from a user via user interfacecomponents 285 and execute appropriate functions, such as browsingfunctions by interpreting these inputs using processor 255.

It can be appreciated that exemplary systems 200 and 250 can have morethan one processor 210 or be part of a group or cluster of computingdevices networked together to provide greater processing capability.

FIG. 3 illustrates a schematic block diagram of an example architecture300 for a network fabric 312. The network fabric 312 can include spineswitches 302 _(A), 302 _(B), . . . , 302 _(N) (collectively “302”)connected to leaf switches 304 _(A), 304 _(B), 304 _(C) . . . 304 _(N)(collectively “304”) in the network fabric 312.

Spine switches 302 can be L3 switches in the fabric 312. However, insome cases, the spine switches 302 can also, or otherwise, perform L2functionalities. Further, the spine switches 302 can support variouscapabilities, such as 40 or 10 Gbps Ethernet speeds. To this end, thespine switches 302 can include one or more 40 Gigabit Ethernet ports.Each port can also be split to support other speeds. For example, a 40Gigabit Ethernet port can be split into four 10 Gigabit Ethernet ports.

In some embodiments, one or more of the spine switches 302 can beconfigured to host a proxy function that performs a lookup of theendpoint address identifier to locator mapping in a mapping database onbehalf of leaf switches 304 that do not have such mapping. The proxyfunction can do this by parsing through the packet to the encapsulated,tenant packet to get to the destination locator address of the tenant.The spine switches 302 can then perform a lookup of their local mappingdatabase to determine the correct locator address of the packet andforward the packet to the locator address without changing certainfields in the header of the packet.

When a packet is received at a spine switch 302 _(i), the spine switch302 _(i) can first check if the destination locator address is a proxyaddress. If so, the spine switch 302 _(i) can perform the proxy functionas previously mentioned. If not, the spine switch 3021 can look up thelocator in its forwarding table and forward the packet accordingly.

Spine switches 302 connect to leaf switches 304 in the fabric 312. Leafswitches 304 can include access ports (or non-fabric ports) and fabricports. Fabric ports can provide uplinks to the spine switches 302, whileaccess ports can provide connectivity for devices, hosts, endpoints,VMs, or external networks to the fabric 312.

Leaf switches 304 can reside at the edge of the fabric 312, and can thusrepresent the physical network edge. In some cases, the leaf switches304 can be top-of-rack (“ToR”) switches configured according to a ToRarchitecture. In other cases, the leaf switches 304 can be aggregationswitches in any particular topology, such as end-of-row (EoR) ormiddle-of-row (MoR) topologies. The leaf switches 304 can also representaggregation switches, for example.

The leaf switches 304 can be responsible for routing and/or bridging thetenant packets and applying network policies. In some cases, a leafswitch can perform one or more additional functions, such asimplementing a mapping cache, sending packets to the proxy function whenthere is a miss in the cache, encapsulate packets, enforce ingress oregress policies, etc.

Moreover, the leaf switches 304 can contain virtual switchingfunctionalities, such as a virtual tunnel endpoint (VTEP) function asexplained below in the discussion of VTEP 408 in FIG. 4. To this end,leaf switches 304 can connect the fabric 312 to an overlay network, suchas overlay network 400 illustrated in FIG. 4.

Network connectivity in the fabric 312 can flow through the leafswitches 304. Here, the leaf switches 304 can provide servers,resources, endpoints, external networks, or VMs access to the fabric312, and can connect the leaf switches 304 to each other. In some cases,the leaf switches 304 can connect EPGs to the fabric 312 and/or anyexternal networks. Each EPG can connect to the fabric 312 via one of theleaf switches 304, for example.

Endpoints 310A-E (collectively “310”) can connect to the fabric 312 vialeaf switches 304. For example, endpoints 310A and 310B can connectdirectly to leaf switch 304A, which can connect endpoints 310A and 310Bto the fabric 312 and/or any other one of the leaf switches 304.Similarly, endpoint 310E can connect directly to leaf switch 304C, whichcan connect endpoint 310E to the fabric 312 and/or any other of the leafswitches 304. On the other hand, endpoints 310C and 310D can connect toleaf switch 304B via L2 network 306. Similarly, the wide area network(WAN) can connect to the leaf switches 304C or 304D via L3 network 308.

Endpoints 310 can include any communication device, such as a computer,a server, a switch, a router, etc. In some cases, the endpoints 310 caninclude a server, hypervisor, or switch configured with a VTEPfunctionality which connects an overlay network, such as overlay network400 below, with the fabric 312. For example, in some cases, theendpoints 310 can represent one or more of the VTEPs 408A-D illustratedin FIG. 4. Here, the VTEPs 408A-D can connect to the fabric 312 via theleaf switches 304. The overlay network can host physical devices, suchas servers, applications, EPGs, virtual segments, virtual workloads,etc. In addition, the endpoints 310 can host virtual workload(s),clusters, and applications or services, which can connect with thefabric 312 or any other device or network, including an externalnetwork. For example, one or more endpoints 310 can host, or connect to,a cluster of load balancers or an EPG of various applications.

Although the fabric 312 is illustrated and described herein as anexample leaf-spine architecture, one of ordinary skill in the art willreadily recognize that the subject technology can be implemented basedon any network fabric, including any data center or cloud networkfabric. Indeed, other architectures, designs, infrastructures, andvariations are contemplated herein.

FIG. 4 illustrates an exemplary overlay network 400. Overlay network 400uses an overlay protocol, such as VXLAN, VGRE, VO3, or STT, toencapsulate traffic in L2 and/or L3 packets which can cross overlay L3boundaries in the network. As illustrated in FIG. 4, overlay network 400can include hosts 406A-D interconnected via network 402.

Network 402 can include a packet network, such as an IP network, forexample. Moreover, network 402 can connect the overlay network 400 withthe fabric 312 in FIG. 3. For example, VTEPs 408A-D can connect with theleaf switches 304 in the fabric 312 via network 402.

Hosts 406A-D include virtual tunnel end points (VTEP) 408A-D, which canbe virtual nodes or switches configured to encapsulate andde-encapsulate data traffic according to a specific overlay protocol ofthe network 400, for the various virtual network identifiers (VNIDs)410A-I. Moreover, hosts 406A-D can include servers containing a VTEPfunctionality, hypervisors, and physical switches, such as L3 switches,configured with a VTEP functionality. For example, hosts 406A and 406Bcan be physical switches configured to run VTEPs 408A-B. Here, hosts406A and 406B can be connected to servers 404A-D, which, in some cases,can include virtual workloads through VMs loaded on the servers, forexample.

In some embodiments, network 400 can be a VXLAN network, and VTEPs408A-D can be VXLAN tunnel end points (VTEP). However, as one ofordinary skill in the art will readily recognize, network 400 canrepresent any type of overlay or software-defined network, such asNVGRE, STT, or even overlay technologies yet to be invented.

The VNIDs can represent the segregated virtual networks in overlaynetwork 400. Each of the overlay tunnels (VTEPs 408A-D) can include oneor more VNIDs. For example, VTEP 408A can include VNIDs 1 and 2, VTEP408B can include VNIDs 1 and 2, VTEP 408C can include VNIDs 1 and 2, andVTEP 408D can include VNIDs 1-3. As one of ordinary skill in the artwill readily recognize, any particular VTEP can, in other embodiments,have numerous VNIDs, including more than the 3 VNIDs illustrated in FIG.4.

The traffic in overlay network 400 can be segregated logically accordingto specific VNIDs. This way, traffic intended for VNID 1 can be accessedby devices residing in VNID 1, while other devices residing in otherVNIDs (e.g., VNIDs 2 and 3) can be prevented from accessing suchtraffic. In other words, devices or endpoints connected to specificVNIDs can communicate with other devices or endpoints connected to thesame specific VNIDs, while traffic from separate VNIDs can be isolatedto prevent devices or endpoints in other specific VNIDs from accessingtraffic in different VNIDs.

Servers 404A-D and VMs 404E-I can connect to their respective VNID orvirtual segment, and communicate with other servers or VMs residing inthe same VNID or virtual segment. For example, server 404A cancommunicate with server 404C and VMs 404E and 404G because they allreside in the same VNID, viz., VNID 1. Similarly, server 404B cancommunicate with VMs 404F and 404H because they all reside in VNID 2.VMs 404E-I can host virtual workloads, which can include applicationworkloads, resources, and services, for example. However, in some cases,servers 404A-D can similarly host virtual workloads through VMs hostedon the servers 404A-D. Moreover, each of the servers 404A-D and VMs404E-I can represent a single server or VM, but can also representmultiple servers or VMs, such as a cluster of servers or VMs.

VTEPs 408A-D can encapsulate packets directed at the various VNIDs 1-3in the overlay network 400 according to the specific overlay protocolimplemented, such as VXLAN, so traffic can be properly transmitted tothe correct VNID and recipient(s). Moreover, when a switch, router, orother network device receives a packet to be transmitted to a recipientin the overlay network 400, it can analyze a routing table, such as alookup table, to determine where such packet needs to be transmitted sothe traffic reaches the appropriate recipient. For example, if VTEP 408Areceives a packet from endpoint 404B that is intended for endpoint 404H,VTEP 408A can analyze a routing table that maps the intended endpoint,endpoint 404H, to a specific switch that is configured to handlecommunications intended for endpoint 404H. VTEP 408A might not initiallyknow, when it receives the packet from endpoint 404B, that such packetshould be transmitted to VTEP 408D in order to reach endpoint 404H.Accordingly, by analyzing the routing table, VTEP 408A can lookupendpoint 404H, which is the intended recipient, and determine that thepacket should be transmitted to VTEP 408D, as specified in the routingtable based on endpoint-to-switch mappings or bindings, so the packetcan be transmitted to, and received by, endpoint 404H as expected.

However, continuing with the previous example, in many instances, VTEP408A may analyze the routing table and fail to find any bindings ormappings associated with the intended recipient, e.g., endpoint 404H.Here, the routing table may not yet have learned routing informationregarding endpoint 404H. In this scenario, the VTEP 408A may likelybroadcast or multicast the packet to ensure the proper switch associatedwith endpoint 404H can receive the packet and further route it toendpoint 404H.

In some cases, the routing table can be dynamically and continuouslymodified by removing unnecessary or stale entries and adding new ornecessary entries, in order to maintain the routing table up-to-date,accurate, and efficient, while reducing or limiting the size of thetable.

As one of ordinary skill in the art will readily recognize, the examplesand technologies provided above are simply for clarity and explanationpurposes, and can include many additional concepts and variations.

Depending on the desired implementation in the network 400, a variety ofnetworking and messaging protocols may be used, including but notlimited to TCP/IP, open systems interconnection (OSI), file transferprotocol (FTP), universal plug and play (UpnP), network file system(NFS), common internet file system (CIFS), AppleTalk etc. As would beappreciated by those skilled in the art, the network 400 illustrated inFIG. 4 is used for purposes of explanation, a network system may beimplemented with many variations, as appropriate, in the configurationof network platform in accordance with various embodiments of thepresent disclosure.

FIG. 5 illustrates an example system embodiment of a controllerconfigured to manage connected data transfer session in a computingnetwork. The controller 500 can be made up of one or more computingnodes in a computing network. For example, the controller 500 can bemade up of one or more switches, routers, end points, computing devices,etc., or combination thereof in the computing network.

The controller 500 can be configured to monitor connected data transfersessions in the computing network. A connected data transfer session canbe an established connection between computing nodes to transfer data.For example, a connected data transfer session can be implemented usinga protocol such as the Transmission Control Protocol (TCP). To establisha connected data transfer session, a negotiation can be performedbetween the computing nodes to establish a socket to socket virtualconnection that remains open throughout the duration of the connecteddata transfer session.

The controller 500 can include a management module 502 configured tomonitor the connected data transfer sessions between computing nodes ofthe computing network and terminate connected data transfer sessions asneeded to manage network resource usage. For example, in someembodiments, the management module 502 can be configured to determinewhether a total number of connected data transfer session meets orexceeds a threshold number and, if so, terminate connected data transfersessions until the total number of connected data transfer session fallsbelow the threshold number.

As another example, in some embodiments, the management module 502 canbe configured to monitor resource usage (e.g., bandwidth, processing,etc.) by the connected data transfer sessions and determine whether thetotal resource usage meets or exceeds a threshold amount. If the totalresource usage does meet or exceed the threshold amount, the managementmodule 502 can terminate connected data transfer sessions until thetotal resource usage falls below the threshold amount.

In some embodiments, the management module 502 can be configured tomonitor both the number of connected data transfer sessions and resourceusage by the connected data transfer sessions to determine whether thetotal number of connected data transfer sessions or the total resourceusage exceeds the threshold number or threshold amount respectively. Ifeither threshold is met or exceeded, the management module 502 canterminate connected data transfer sessions until the total number ofconnected data transfer sessions and the total resource usage fall belowtheir respective threshold.

In some embodiments, the threshold number of connected data transfersessions and the threshold amount of resource usage can be dynamic. Forexample, the management module 502 can adjust the thresholds based onanticipated use of connected data transfer sessions and/or anticipatedresource usage. The management module 502 can lower on or more of thethresholds if the anticipated use is high and, conversely, raise one ormore of the thresholds if the anticipated use is low. For example, ifthe management module 502 determines that requests to establishconnected data transfer sessions are being received at a higher thanaverage rate, the management module 502 can lower the threshold numberto ensure that other connected data transmission sessions are terminatedsooner to facilitate the new requests. As another example, if themanagement module 502 determines that requests to establish connecteddata transfer sessions are being received at a lower than average rate,the management module 502 can increase the threshold number.

Terminating a connected data transfer session can include terminatingthe socket to socket virtual connection between the computing nodesutilizing the connected data transfer session, thereby freeing theresources used by the connected data transfer session. In someembodiments, the management module 502 can terminate a connected datatransfer session by transmitting a termination message to each computingnode utilizing the connected data transfer. The termination message caninstruct the computing nodes to terminate the connected data transfersession.

Alternatively, in some embodiments, the management module 502 cantransmit a termination message to one of the computing nodes utilizingthe connected data transfer session. The termination message caninstruct the computing node to terminate the connected data transfersession as well as send a message to the other computing nodes utilizingthe connected data transfer session to instruction the other computingnodes to terminate the connected data transfer session.

The management module 502 can select connected data transfer sessions toterminate in any number of ways. For example, in some embodiments, themanagement module 502 can select connected data transfer sessions atrandom to be terminated. As another example, the management module 502can select connected data transfer sessions to terminate based on timestamp values associated with the connected data transfer sessions. Atime stamp value for a connected data transfer session can indicate thetime at which the latest data packet was transmitted using the datatransfer sessions. The time stamp value for a connected data transfersession can be updated each time the connected data transfer session isused to transmit a data packet.

The management module 502 can terminate a connected data transfersession to terminate based on the time stamp values. For example, themanagement module 502 can be configured to terminate the connected datatransfer session with the earliest time stamp value. As a result, themanagement module 502 will terminate the connected data transfer sessionthat has remained unused the longest.

As another example, the management module 502 can terminate anyconnected data transfer session with a time stamp value that is earlierthan a threshold time value, regardless of which timestamp value is theearliest overall. As a result, the management module 502 can terminateany connected data transfer session that has remained unused for atleast a specified period of time. In some embodiments, the thresholdtime value can be a dynamic value based on a current time value. Forexample, the threshold time value can be a specified amount of timeprior to the current time value, such as 5 minutes prior to the currenttime value. Using this example, the management module 502 can terminateany connected data transfer session that has remained unused for atleast 5 minutes.

In some embodiments, the management module 502 can select a connecteddata transfer session to terminate based on applications, services,computer nodes and/or users utilizing the connected data transfersession. For example, some application, services, computer nodes and/orusers utilizing can be considered high priority, while otherapplications, services, computer nodes and/or users can be consideredlower priority. The management module 502 can identify and terminateconnected data transfer sessions that are utilized by applications,services, computer nodes and/or uses considered to be low priority. Insome embodiments, some applications, services, computer nodes and/orusers can be considered such high priority that the management module502 will not terminate connected data transfer sessions utilized bythese applications, services, computer nodes and/or users.

In some embodiments, the management module 502 can select a connecteddata transfer session to terminate based on user assigned priorityvalues for the connected data transfer sessions. For example, a user mayassign or flag a connected data transfer session to indicate thepriority level of the connected data transfer session, such as highpriority, mid priority or low priority. The management module 502 canselect a connected data transfer session to terminate based on theassigned priority levels such that the management module terminates aconnected data transfer session assigned or flagged with a lowestassigned priority level. In some embodiments, a user can flag aconnected data transfer session to indicate that the connected datatransfer session should not be terminated and the management module 502can be configured to not terminate these connected data transfersessions.

In some embodiments, the management module 502 can select connected datatransfer sessions to terminate based on a ranking of the connected datatransfer session. The ranking can be based on one or more factors andcan indicate an order in which the connected data transfer sessionsshould be terminated. The controller 500 can include a ranking module504 configured to rank the connected data transfer sessions and providethe ranking to the management module 502. The management module 502 canthen terminate connected data transfer sessions based on the ranking.

In some embodiments, the ranking module 504 can rank all of theconnected data transfer sessions. Alternatively, in some embodiments,the ranking module 504 can rank a subset of the connected data transfersessions. For example, the ranking module 504 can rank the connecteddata transfer sessions that have not been flagged or otherwise indicatedas being high priority and/or to not be terminated.

The ranking module 504 can rank the connected data transfer sessionsbased on any number of factors, such as timestamp values, assignedpriority levels, applications, services, computer nodes and/or usersutilizing, etc. Further, the ranking module 504 can apply varyingweights to the various factors when determining the ranking.

The resulting ranking can indicate an order in which the connected datatransfer sessions are to be terminated. For example, the ranking module504 can rank the connected data transfer session such that the connecteddata transfer sessions should be terminated in descending order from thehighest ranked to the lowest ranked. Alternatively, the ranking module504 can rank the connected data transfer session such that the connecteddata transfer sessions should be terminated in ascending order from thelowest ranked to the highest ranked.

In some embodiments, the ranking module 504 can continuously rank theconnected data transfer session. For example, the ranking module 504 cangather data based on a set schedule, such as every 1 second, 2 seconds,etc., and a re-rank or update the ranking based on the gathered data.Alternatively, in some embodiments, the ranking module 504 can re-rankor update the ranking each time the management module 502 determinesthat the total number of connected data transfer sessions or the totalresource usage of the connected data transfer sessions exceeds itsrespective threshold.

The management module 502 can terminate connected data transfer sessionuntil the total number of connected data transfer sessions and/or thetotal resource usage of the connected data transfer sessions falls belowthe threshold number or threshold amount respectively. This can includeterminating just enough connected data transfer session to fall belowthe threshold or, alternatively, this can include terminating moreconnected data transfer sessions than are necessary to fall below thethreshold. For example, the management module 502 can terminate allconnected data transfer sessions with a time stamp value earlier than athreshold time value, even if terminating only a subset of theseconnected data transfer sessions would be sufficient to bring the totalnumber of connected data sessions or the total resource usage below itsrespective threshold. As another example, the management module 502 canterminate all of the connected data transfer sessions with a rankingbelow a threshold ranking. As another example, the management module 502can terminate all of the connected data transfer sessions with apriority level lower than a threshold priority level.

In some embodiments, the management module 502 may terminate fewerconnected data transfer sessions than are necessary to fall below athreshold. For example, the management module 502 can be configured tonot terminate a connected data transfer sessions if the time stamp valuefor the connected data transfer session is later than a threshold timevalue, if the ranking for the connected data transfer session is greaterthan a threshold ranking and/or if the priority level of the connecteddata transfer session if above a threshold priority level, even ifenforcing this policy results in the total number of connected datatransfer sessions or the total resource usage remaining at or above itsrespective threshold. As a result, connected data transfer sessionsdetermined to be of high value and/or that are being actively used willnot be terminated, even if doing so causes some level of networkcongestions.

Having disclosed some basic system components and concepts, thedisclosure now turns to the example methods shown in FIGS. 6 and 7. Forthe sake of clarity, the methods are described in terms of systems shownin FIGS. 1-5. The steps outlined herein are example and can beimplemented in any combination thereof, including combinations thatexclude, add, or modify certain steps.

FIG. 6 illustrates one example method of a controller 500 managingconnected data transfer sessions in a computing network. At step 602, acontroller 500 can determine a total number of connected data transfersessions between computing nodes in a computing network.

At step 604, the controller 500 can determine whether the total numberof connected data transfer sessions meets or exceeds a threshold numberof connected data transfer session. If the controller determines thetotal number of connected data transfer sessions meets or exceeds thethreshold number of connected data transfer session, the method cancontinue to step 606 where the controller 500 can terminate a connecteddata transfer session. The controller 500 can terminate a connected datatransfer session based on one or more factors, such as a timestampsvalue, assigned priority, ranking, etc. The method can then return tostep 602.

FIG. 7 illustrates another example method of a controller managingconnected data transfer sessions in a computing network. At step 702, acontroller 500 can determine a total amount of resources used byconnected data transfer sessions in a computing network.

At step 704, the controller 500 can determine whether the total amountof resources meets or exceeds a threshold amount of resources. If thecontroller determines the total amount resourced does meets or exceedsthe threshold amount, the method can continue to step 706 where thecontroller 500 can terminate a connected data transfer session. Thecontroller 500 can terminate a connected data transfer session based onone or more factors, such as a timestamps value, assigned priority,ranking, etc. The method can then return to step 702.

As one of ordinary skill in the art will readily recognize, the examplesand technologies provided above are simply for clarity and explanationpurposes, and can include many additional concepts and variations.

For clarity of explanation, in some instances the present technology maybe presented as including individual functional blocks includingfunctional blocks comprising devices, device components, steps orroutines in a method embodied in software, or combinations of hardwareand software.

In some embodiments the computer-readable storage devices, mediums, andmemories can include a cable or wireless signal containing a bit streamand the like. However, when mentioned, non-transitory computer-readablestorage media expressly exclude media such as energy, carrier signals,electromagnetic waves, and signals per se.

Methods according to the above-described examples can be implementedusing computer-executable instructions that are stored or otherwiseavailable from computer readable media. Such instructions can comprise,for example, instructions and data which cause or otherwise configure ageneral purpose computer, special purpose computer, or special purposeprocessing device to perform a certain function or group of functions.Portions of computer resources used can be accessible over a network.The computer executable instructions may be, for example, binaries,intermediate format instructions such as assembly language, firmware, orsource code. Examples of computer-readable media that may be used tostore instructions, information used, and/or information created duringmethods according to described examples include magnetic or opticaldisks, flash memory, USB devices provided with non-volatile memory,networked storage devices, and so on.

Devices implementing methods according to these disclosures can comprisehardware, firmware and/or software, and can take any of a variety ofform factors. Typical examples of such form factors include laptops,smart phones, small form factor personal computers, personal digitalassistants, rackmount devices, standalone devices, and so on.Functionality described herein also can be embodied in peripherals oradd-in cards. Such functionality can also be implemented on a circuitboard among different chips or different processes executing in a singledevice, by way of further example.

The instructions, media for conveying such instructions, computingresources for executing them, and other structures for supporting suchcomputing resources are means for providing the functions described inthese disclosures.

Although a variety of examples and other information was used to explainaspects within the scope of the appended claims, no limitation of theclaims should be implied based on particular features or arrangements insuch examples, as one of ordinary skill would be able to use theseexamples to derive a wide variety of implementations. Further andalthough some subject matter may have been described in languagespecific to examples of structural features and/or method steps, it isto be understood that the subject matter defined in the appended claimsis not necessarily limited to these described features or acts. Forexample, such functionality can be distributed differently or performedin components other than those identified herein. Rather, the describedfeatures and steps are disclosed as examples of components of systemsand methods within the scope of the appended claims. Moreover, claimlanguage reciting “at least one of” a set indicates that one member ofthe set or multiple members of the set satisfy the claim.

For clarity of explanation, in some instances the present technology maybe presented as including individual functional blocks includingfunctional blocks comprising devices, device components, steps orroutines in a method embodied in software, or combinations of hardwareand software.

Note that in certain example implementations, the optimization and/orplacement functions outlined herein may be implemented by logic encodedin one or more tangible, non-transitory media (e.g., embedded logicprovided in an application specific integrated circuit [ASIC], digitalsignal processor [DSP] instructions, software [potentially inclusive ofobject code and source code] to be executed by a processor, or othersimilar machine, etc.). The computer-readable storage devices, mediums,and memories can include a cable or wireless signal containing a bitstream and the like. However, when mentioned, non-transitorycomputer-readable storage media expressly exclude media such as energy,carrier signals, electromagnetic waves, and signals per se.

Methods according to the above-described examples can be implementedusing computer-executable instructions that are stored or otherwiseavailable from computer readable media. Such instructions can comprise,for example, instructions and data which cause or otherwise configure ageneral purpose computer, special purpose computer, or special purposeprocessing device to perform a certain function or group of functions.Portions of computer resources used can be accessible over a network.The computer executable instructions may be, for example, binaries,intermediate format instructions such as assembly language, firmware, orsource code. Examples of computer-readable media that may be used tostore instructions, information used, and/or information created duringmethods according to described examples include magnetic or opticaldisks, flash memory, USB devices provided with non-volatile memory,networked storage devices, and so on.

Devices implementing methods according to these disclosures can comprisehardware, firmware and/or software, and can take any of a variety ofform factors. Typical examples of such form factors include laptops,smart phones, small form factor personal computers, personal digitalassistants, and so on. Functionality described herein also can beembodied in peripherals or add-in cards. Such functionality can also beimplemented on a circuit board among different chips or differentprocesses executing in a single device, by way of further example.

The instructions, media for conveying such instructions, computingresources for executing them, and other structures for supporting suchcomputing resources are means for providing the functions described inthese disclosures.

Although a variety of examples and other information was used to explainaspects within the scope of the appended claims, no limitation of theclaims should be implied based on particular features or arrangements insuch examples, as one of ordinary skill would be able to use theseexamples to derive a wide variety of implementations. Further andalthough some subject matter may have been described in languagespecific to examples of structural features and/or method steps, it isto be understood that the subject matter defined in the appended claimsis not necessarily limited to these described features or acts. Forexample, such functionality can be distributed differently or performedin components other than those identified herein. Rather, the describedfeatures and steps are disclosed as examples of components of systemsand methods within the scope of the appended claims.

What is claimed is:
 1. A computer-implemented method comprising:determining a resource usage of connected data transfer sessions betweencomputing nodes in a computing network; determining whether the resourceusage of connected data transfer sessions meets or exceeds a thresholdvalue; and in response to a determination that the resource usage ofconnected data transfer sessions meets or exceeds the threshold value,terminating at least one connected data transfer session of theconnected data transfer sessions.
 2. The computer-implemented method ofclaim 1, wherein the termination of the at least one connected datatransfer sessions is based on time stamp values corresponding to the oneor more connected data transfer sessions.
 3. The computer-implementedmethod of claim 1, wherein the termination of the at least one connecteddata transfer sessions is based on lack of usage for at least a specificperiod of time.
 4. The computer-implemented method of claim 1, whereinthe termination of the at least one connected data transfer sessions isbased on priority of application, service or computing nodes utilizingthe connected data transfer sessions.
 5. The computer-implemented methodof claim 1, further comprising: re-establishing the at least oneterminated connected data transfer session when the resource usage isless than the threshold value.
 6. The computer-implemented method ofclaim 1, further comprising: ranking the connected data transfersessions based on one or more ranking criterion, yielding a sessionranking, wherein the terminating is based on the session ranking.
 7. Thecomputer-implemented method of claim 1, wherein the threshold value isadjustable based on anticipated resource usage.
 8. A system comprising:at least one processor; and at least one memory storing instructions,which when executed by the at least one processor, causes the at leastone processor to: determine a resource usage of connected data transfersessions between computing nodes in a computing network; determinewhether the resource usage of connected data transfer sessions meets orexceeds a threshold value; and in response to a determination that theresource usage of connected data transfer sessions meets or exceeds thethreshold value, terminate at least one connected data transfer sessionof the connected data transfer sessions.
 9. The system of claim 8,wherein the termination of the at least one connected data transfersessions is based on time stamp values corresponding to the one or moreconnected data transfer sessions.
 10. The system of claim 8, wherein thetermination of the at least one connected data transfer sessions isbased on lack of usage for at least a specific period of time.
 11. Thesystem of claim 8, wherein the termination of the at least one connecteddata transfer sessions is based on priority of application, service orcomputing nodes utilizing the connected data transfer sessions.
 12. Thesystem of claim 8, further comprising instructions, which when executedby the at least one processor, causes the at least one processor to:re-establish the at least one terminated connected data transfer sessionwhen the resource usage is less than the threshold value.
 13. The systemof claim 8, further comprising instructions, which when executed by theat least one processor, causes the at least one processor to: rank theconnected data transfer sessions based on one or more ranking criterion,yielding a session ranking, wherein the termination is based on thesession ranking.
 14. The system of claim 8, wherein the threshold valueis adjustable based on anticipated resource usage.
 15. At least onenon-transitory computer readable medium storing instructions, which whenexecuted by at least one processor, causes the at least one processorto: determine a resource usage of connected data transfer sessionsbetween computing nodes in a computing network; determine whether theresource usage of connected data transfer sessions meets or exceeds athreshold value; and in response to a determination that the resourceusage of connected data transfer sessions meets or exceeds the thresholdvalue, terminate at least one connected data transfer session of theconnected data transfer sessions.
 16. The at least one non-transitorycomputer readable medium of claim 15, wherein the termination of the atleast one connected data transfer sessions is based on time stamp valuescorresponding to the one or more connected data transfer sessions. 17.The at least one non-transitory computer readable medium of claim 15,wherein the termination of the at least one connected data transfersessions is based on lack of usage for at least a specific period oftime.
 18. The at least one non-transitory computer readable medium ofclaim 15, wherein the termination of the at least one connected datatransfer sessions is based on priority of application, service orcomputing nodes utilizing the connected data transfer sessions.
 19. Theat least one non-transitory computer readable medium of claim 15,further comprising instructions, which when executed by the at least oneprocessor, causes the at least one processor to: re-establish the atleast one terminated connected data transfer session when the resourceusage is less than the threshold value.
 20. The at least onenon-transitory computer readable medium of claim 15, further comprisinginstructions, which when executed by the at least one processor, causesthe at least one processor to: rank the connected data transfer sessionsbased on one or more ranking criterion, yielding a session ranking,wherein the termination is based on the session ranking.